Constructing 4-Valent 12-Transitive Graphs with a Nonsolvable Automorphism Group

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing 4-Valent 1/2-Transitive Graphs with a Nonsolvable Automorphism Group

A graph is said to be 1 2-transitive if its automorphism group is ver-tex and edge but not arc-transitive. For each n 11, a 1 2-transitive graph of valency 4 and girth 6, with the automorphism group isomor-phic to A n Z 2 , is given.

متن کامل

Constructing 12 - Transitive Graphs of Valency 4 Andvertex

An innnite familiy of 1 2-transitive graphs of valency 4 with alternating cycles of length 4 is given. Besides, an innnite family of 1 2-transitive graphs of valency 4 with vertex stabilizer isomorphic to Z 2 Z 2 , is constructed.

متن کامل

AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

متن کامل

Distance Transitive Graphs with Symmetric or Alternating Automorphism Group

for some n , acting primitively on the set of vertices. This forms a part of the programme for the classification of all finite primitive distance transitive graphs begun in [76]; for in [76] this classification is reduced to the determination of all such graphs whose automorphism group G is either almost simple (that is, T o f f S Aut T for some nonabelian simple group T ) or affine (that is, ...

متن کامل

Group amalgams of index (4, 2) and 4-valent 2-arc-transitive graphs

A finite group amalgam of index (k,m) is a 5-tuple (L,φ,B, ψ,R) where L, B, and R are finite groups, φ : B → L and ψ : B → R are monomorphisms, and the indices of B and B in L and R are k and m, respectively. The amalgam is faithful if N ≤ B, N C L, and N C R implies N = 1. It is well known that the finite faithful amalgams of index (k, 2) are in a bijective correspondence with (the conjugacy c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1999

ISSN: 0095-8956

DOI: 10.1006/jctb.1998.1857